A Uniform Indexing Scheme for Object-Oriented Databases
نویسنده
چکیده
| Object-oriented databases (OODB) have received considerable attention in recent years. Their performance is a critical factor hindering their current use. Several indexing schemes have been proposed in the literature for enhancing OODB performance and they are brieey reviewed here. In this paper a new and uniform indexing scheme is proposed. This scheme is based on a single B-tree and combines both the hierarchical and nested indexing schemes. The uniformity of this scheme enables compact and optimized code for dealing with a large range of queries on the one hand, and exibility in adding and removing indexed paths on the other hand. The performance of the scheme is discussed and an extensive experimental analysis for the class-hierarchy case is presented. The results show the advantages of the scheme for small range, clustered sets queries.
منابع مشابه
Function-based indexing for object-oriented databases
Object-oriented databases have been developed to allow applications to store persistent data in the form of objects. As in conventional databases, object-oriented databases need to support queries that allow associative access to data by describing a property of the data of interest. In particular, they should support queries over user-de ned sets based on user-de ned functions that compute the...
متن کاملJoin Index Hierarchy: An Indexing Structure for Efficient Navigation in Object-Oriented Databases
A novel indexing structure, join index hierarchy, is proposed to handle the \goto's on disk" problem in object-oriented query processing. The method constructs a hierarchy of join indices and transforms a sequence of pointer chasing operations into a simple search in an appropriate join index le, and thus accelerates navigation in object-oriented databases. The method extends the join index str...
متن کاملAn Indexing Technique for Object-Oriented Databases
We present an indexing technique providing efficient support for object-oriented queries. We first briefly discuss object-oriented query languages. Then, we describe the indexing technique and the associated operations. A preliminary comparison of our technique with previously defined access mechanisms is also presented.
متن کاملOID : 4 Name : Fortran
A novel indexing structure, join index hierarchy, is proposed to handle the \goto's on disk" problem in object-oriented query processing. The method constructs a hierarchy of join indices and transforms a sequence of pointer chasing operations into a simple search in an appropriate join index le, and thus accelerates navigation in object-oriented databases. The method extends the join index str...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996